Operations on polytopes: application to tolerance analysis

نویسندگان

  • Denis Teissandier
  • Vincent Delos
  • Yves Couétard
چکیده

This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric constraints, a finite set of contact constraints and a finite set of functional constraints. Mathematically each constraint formalises a n-face (hyperplan of dimension n) of a n-polytope (1 ≤ n ≤ 6). Thus the relative position between two any surfaces of a mechanism can be calculated with two operations on polytopes : the Minkowski sum and the Intersection. The result is a new polytope: the calculated polytope. The inclusion of the calculated polytope inside the functional polytope indicates if the functional requirement is satisfied or not satisfied. Examples illustrate these numerical methods. 1. INTRODUCTION The variational classes by Requicha were introduced at the beginning of the 80's and propose a model of tolerances of form, orientation, position and dimension [Requicha, 1983]. A generalization of specifications by volume envelopes is based on the works of Requicha [Srinivasan and al., 1989]. Fleming presents a model for geometric tolerances and constraints from contacts [Fleming, 1988]. Among the dimension-chains models based on Small Displacements Torsor concept [Clément and al., 1988], we note the Clearance Deviation Space by Giordano [Giordano and al., 1993]. The Clearance Deviation Space purposes an assembly method according to maximum material condition limit.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithm to calculate the Minkowski sums of 3-polytopes dedicated to tolerance analysis

Prompted by the development of algorithms for analysing geometric tolerancing, this article describes a method to determine the Minkowski sum for 3-dimension polytopes. This purposed method is based exclusively on intersection operations on normal cones, using the properties of the normal fan of a Minkowski sum obtained by common refinement of the normal fans of the operands. It can be used to ...

متن کامل

Algorithm to calculate the Minkowski sums of 3-polytopes : application to tolerance analysis

In tolerance analysis, it is necessary to check that the cumulative defect limits specified for the component parts of a product are compliant with the functional requirements expected of the product. Cumulative defect limits can be modelled using a calculated polytope, the result of a set of intersections and Minkowski sums of polytopes. This article presents a method to be used to determine f...

متن کامل

Tolerance analysis by polytopes: Taking into account degrees of freedom with cap half-spaces

To determine the relative position of any two surfaces in a system, one approach is to use operations (Minkowski sum and intersection) on sets of constraints. These constraints are made compliant with half-spaces of n  where each set of half-spaces defines an operand polyhedron. These operands are generally unbounded due to the inclusion of degrees of invariance for surfaces and degrees of fre...

متن کامل

Efficient Computation of Regularized Boolean Operations on the Extreme Vertices Model in the n-Dimensional Space (nD-EVM)

The objective behind this work is to describe the Extreme Vertices Model in the n-Dimensional Space (nD-EVM) and the way it represents nD Orthogonal Pseudo Polytopes (nD-OPPs) by considering only a subset of their vertices: the Extreme Vertices. There are presented the Regularized Boolean Operators and the way they assure the dimensional homogeneity. Algorithms for performing Regularized Boolea...

متن کامل

Linear Programming, the Simplex Algorithm and Simple Polytopes

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1106.6148  شماره 

صفحات  -

تاریخ انتشار 2011